Independent transversal equitable domination in graphs
نویسندگان
چکیده
منابع مشابه
Independent transversal domination in graphs
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملEquitable Edge Domination in Graphs
A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| 6 1. The minimum cardinality of such a dominating set is denoted by γe(G) and is called equitable domination number of G. In this paper we introduce the equitable edge domination and equitable edge domatic number in a graph, exact...
متن کاملtwo-out degree equitable domination in graphs
an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.
متن کاملNeighborhood Connected Equitable Domination in Graphs
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph 〈Ne(S)〉 is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by γnce(G). In this paper we initiate a study of this parameter. For any gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2013
ISSN: 1314-7536
DOI: 10.12988/imf.2013.13078